Discrete-time network-based control under scheduling and actuator constraints

This paper is concerned with the solution bounds for discrete-time networked control systems via delay-dependent Lyapunov–Krasovskii methods. Solution bounds are widely used for systems with input saturation caused by actuator saturation or by the quantizers with saturation. The time-delay approach has been developed recently for the stabilization of continuous-time networked control systems under the roundrobin protocol and under a weighted try-once-discard protocol, respectively. Actuator saturation has not been taken into account. In the present paper, for the first time, the time-delay approach is extended to the stability analysis of the discrete-time networked control systems under both scheduling protocols and actuators saturation. The communication delays are allowed to be larger than the sampling intervals. A novel Lyapunov-based method is presented for finding the domain of attraction. Polytopic uncertainties in the system model can be easily included in our analysis. The efficiency of the time-delay approach is illustrated on the example of a cart–pendulum system. Copyright © 2014 John Wiley & Sons, Ltd.